More Combinatorics of Fulton’s Essential Set

نویسنده

  • Masato Kobayashi
چکیده

Abstract We develop combinatorics of Fulton’s essential set particularly with a connection to Baxter permutations. For this purpose, we introduce a new idea: dual essential sets. Together with the original essential set, we reinterpret Eriksson-Linusson’s characterization of Baxter permutations in terms of colored diagrams on a square board. We also discuss a combinatorial structure on local moves of these essential sets under weak order on the symmetric groups. As an application, we extend several familiar results on Bruhat order for permutations to alternating sign matrices: We establish an improved criterion of Bruhat-Ehresmann order as well as Generalized Lifting Property using bigrassmannian permutations, a certain subclass of Baxter permutations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The sum-annihilating essential ideal graph of a commutative ring

Let $R$ be a commutative ring with identity. An ideal $I$ of a ring $R$is called an annihilating ideal if there exists $rin Rsetminus {0}$ such that $Ir=(0)$ and an ideal $I$ of$R$ is called an essential ideal if $I$ has non-zero intersectionwith every other non-zero ideal of $R$. Thesum-annihilating essential ideal graph of $R$, denoted by $mathcal{AE}_R$, isa graph whose vertex set is the set...

متن کامل

The Order Steps of an Analytic Combinatorics

‎Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures‎. ‎This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines‎, ‎including probability theory‎, ‎statistical physics‎, ‎computational biology and information theory‎. ‎With a caref...

متن کامل

Computing Intersection Multiplicity via Triangular Decomposition

Fulton’s algorithm is used to calculate the intersection multiplicity of two plane curves about a rational point. This work extends Fulton’s algorithm first to algebraic points (encoded by regular chains) and then, with some generic assumptions, to l many hypersurfaces. Out of necessity, we give a standard-basis free method (i.e. practically efficient method) for calculating tangent cones at po...

متن کامل

Strength of strongest dominating sets in fuzzy graphs

A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...

متن کامل

Complete forcing numbers of polyphenyl systems

The idea of “forcing” has long been used in many research fields, such as colorings, orientations, geodetics and dominating sets in graph theory, as well as Latin squares, block designs and Steiner systems in combinatorics (see [1] and the references therein). Recently, the forcing on perfect matchings has been attracting more researchers attention. A forcing set of M is a subset of M contained...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013